Fast Floating Point Square Root
نویسندگان
چکیده
Hain and Freire have proposed different floating point square root algorithms that can be efficiently implemented in hardware. The algorithms are compared and evaluated on both performance and precision.
منابع مشابه
Variable Precision Floating-Point Divide and Square Root for Efficient FPGA Implementation of Image and Signal Processing Algorithms
Field Programmable Gate Arrays (FPGAs) are frequently used to accelerate signal and image processing algorithms due to their flexibility, relatively low cost, high performance and fast time to market. For those applications where the data has large dynamic range, floating-point arithmetic is desirable due to the inherent limitations of fixed-point arithmetic. Moreover, optimal reconfigurable ha...
متن کاملFast calculation of inverse square root with the use of magic constant - analytical approach
We present a mathematical analysis of transformations used in fast calculation of inverse square root for single-precision floating-point numbers. Optimal values of the so called magic constants are derived in a systematic way, minimizing either absolute or relative errors at subsequent stages of the discussed algorithm.
متن کاملImproving the accuracy of the fast inverse square root algorithm
We present improved algorithms for fast calculation of the inverse square root for single-precision floating-point numbers. The algorithms are much more accurate than the famous fast inverse square root algorithm and have the same or similar computational cost. The main idea of our work consists in modifying the NewtonRaphson method and demanding that the maximal error is as small as possible. ...
متن کاملA fast floating-point square-rooting routine for the 8080/8085 microprocessors
Square-root is a function for which numerous numerical methods have been developed. In most math packages for microprocessors, simple iterative methods have been used, as no special demands for speed — nor even for accuracy in some cases are expected: e.g. in [ l ] and [2] the execution time of square-rooting is approx. 2-5 times longer than that of multiplication, and in [3] a quintuple error ...
متن کاملProving the IEEE Correctness of Iterative Floating-Point Square Root, Divide, and Remainder Algorithms
The work presented in this paper was initiated as part of a study on software alternatives to the hardware implementations of floating-point operations such as divide and square root. The results of the study proved the viability of software implementations, and showed that certain proposed algorithms are comparable in performance to current hardware implementations. This paper discusses two co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005